منابع مشابه
A Survey of Cognitive and Psychological Factors Effective on Travelling
Nowadays, due to the advances of many industries people tend to travel much more in compared to the past. Without any doubt, various types of climates and weathers, vemacular diseases, changes in life style and qualitative and quantitative changes of nutrition are all the factors of which many diseases occur during trips. Travel associated anxieties and fears are common. It has been suggested t...
متن کاملA Survey on Travelling Salesman Problem
The Travelling Salesman problem is one of the most popular problems from the NP set, it is also one of the hardest too. The solution to this problem enjoys wide applicability in a variety of practical fields. Thus it highly raises the need for an efficient solution for this NP Hard problem. However even the most common deterministic solutions to the problem are known to possess an exponential t...
متن کاملOn analyticity of travelling water waves
In this paper we establish the existence and analyticity of periodic solutions of a classical free-boundary model of the evolution of three-dimensional, capillary–gravity waves on the surface of an ideal fluid. The result is achieved through the application of bifurcation theory to a boundary perturbation formulation of the problem, and it yields analyticity jointly with respect to the perturba...
متن کاملTravelling bioethics
When there are no strikes or natural disasters, travelling usually is a pleasure. Some of us have returned from the annual conference of the American Society for Bioethics and Humanities in San Diego, while others have good memories of the 10th World Congress of Bioethics in Singapore last summer. But not only bioethicists are travelling, bioethics itself is as well, following the globalization...
متن کاملOn Random Symmetric Travelling Salesman Problems
Let the edges of the complete graph Kn be assigned independent uniform [0; 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor respectively. We show that whp jZTSP Z2FAC j = o(1). The proof is via by the analysis of a polynomial time algorithm that nds a tour only a little longer than Z2FAC .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Literary Imagination
سال: 2020
ISSN: 1523-9012,1752-6566
DOI: 10.1093/litimag/imaa048